Energy Efficient Mcds Algorithm for Manets Based on Convex Hulls

This paper proposes and analyzes energy efficient Convex Hull based Minimum Connected Dominating Set [CHMCDS] algorithm. The algorithm achieves energy efficiency, bandwidth efficiency, reliability and robustness by reducing redundant rebroadcasts of control packets in the network. The Connected Dominating Set (CDS) is widely used as a virtual backbone or Spine in mobile ad-hoc networks for the purpose of routing and broadcasting. Here the MCDS is based on distributed Convex Hull algorithm and Unit Disk Graph. In this paper we use a quick hull algorithm with incremental sweeping which is more suitable for the MANETs than other algorithms. Mobility and Residual energy of the nodes are considered as parameters in the maintenance of MCDS. The resultant CHMCDS has relatively longer lifetime than other MCDS algorithms. This is a distributed algorithm with a time complexity of O(nh log n) and the message complexity O(nh log n), where ‘n’ is the number of nodes in the network and ‘h’ is the number of convex hull nodes in the network. The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. The cardinality and the performance ratio of this CHMCDS algorithm are optimal compared with existing MCDS algorithms. The simulation results show that the proposed algorithm performs better.